Modifying the Parti-game Algorithm for Increased Robustness, Higher Eeciency and Better Policies
نویسندگان
چکیده
Parti-game (Moore 1994a; Moore 1994b; Moore and Atkeson 1995) is a reinforcement learning (RL) algorithm that has a lot of promise in overcoming the curse of dimensionality (Bellman 1957) that can plague RL algorithms when applied to high-dimensional problems. In this paper we introduce modiications to the algorithm that further improve its performance and robustness. In addition, while parti-game solutions can be improved locally by standard local path-improvement techniques , we introduce an add-on algorithm in the same spirit as parti-game that instead tries to improve solutions in a non-local manner.
منابع مشابه
Robust, Efficient, Globally-Optimized Reinforcement Learning with the Parti-Game Algorithm
Parti-game (Moore 1994a; Moore 1994b; Moore and Atkeson 1995) is a reinforcement learning (RL) algorithm that has a lot of promise in overcoming the curse of dimensionality that can plague RL algorithms when applied to high-dimensional problems. In this paper we introduce modifications to the algorithm that further improve its performance and robustness. In addition, while parti-game solutions ...
متن کاملNGTSOM: A Novel Data Clustering Algorithm Based on Game Theoretic and Self- Organizing Map
Identifying clusters is an important aspect of data analysis. This paper proposes a noveldata clustering algorithm to increase the clustering accuracy. A novel game theoretic self-organizingmap (NGTSOM ) and neural gas (NG) are used in combination with Competitive Hebbian Learning(CHL) to improve the quality of the map and provide a better vector quantization (VQ) for clusteringdata. Different ...
متن کاملUsing game theory approach to interpret stable policies for Iran’s oil and gas common resources conflicts with Iraq and Qatar
Oil and gas as the non-renewable resources are considered very valuable for the countries with petroleum economics. These resources are not only diffused equally around the world, but also they are common in some places which their neighbors often come into conflicts. Consequently, it is vital for those countries to manage their resource utilization. Lately, game theory was applied in conflict ...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملSpeeding up the Parti-Game Algorithm
In this paper, we introduce an efficient replanning algorithm for nondeterministic domains, namely what we believe to be the first incremental heuristic minimax search algorithm. We apply it to the dynamic discretization of continuous domains, resulting in an efficient implementation of the parti-game reinforcement-learning algorithm for control in high-dimensional domains.
متن کامل